An Asynchronous Automata Approach to the Semantics of Temporal Logic
نویسنده
چکیده
The paper presents the differential equations that characterize an asynchronous automaton and gives their solution n x } 1 , 0 { : → R . Remarks are made on the connection between the continuous time and the discrete time of the approach. The continuos and discrete time, linear and branching temporal logics have the semantics depending on x and their formulas give the properties of the automaton.
منابع مشابه
Selected Topics in Asynchronous Automata
The paper is concerned with the modeling of the electrical signals and of the asynchronous circuits by } 1 , 0 { → R functions and asynchronous automata. The equations of the asynchronous automata are written and solved; the stability, the fundamental mode of operation, the semi-modularity and some aspects of semantics of the propositional temporal logic as seen from behind asynchronous automat...
متن کاملA temporal logic for the specification and verification of distributed behaviour
In this work we develop a temporal logic with fixpoints for distributed processes or distributed systems. Standard temporal logics refer to sequential processes (execution sequences) of distributed systems. Expressive temporal operators such as “Until” can be expressed as fixpoints of formulae involving only the simple “Next” modality. Fixpoint logics for sequential processes are known to be ex...
متن کاملAlternating-Time Stream Logic for Multi-agent Systems
Constraint automata have been introduced to provide a compositional, operational semantics for the exogenous coordination language Reo, but they can also serve interface specification for components and an operational model for other coordination languages. Constraint automata have been used as basis for equivalence checking and model checking temporal logical properties. The main contribution ...
متن کاملBounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous systems a generalization of communicating automata, 1-safe Petri nets, are used. It is shown how a 1-safe Petri net and a requirement on the behavior of the net can be translated into a logic program such that the bounded ...
متن کاملOptimization of Quantum Cellular Automata Circuits by Genetic Algorithm
Quantum cellular automata (QCA) enables performing arithmetic and logic operations at the molecular scale. This nanotechnology promises high device density, low power consumption and high computational power. Unlike the CMOS technology where the ON and OFF states of the transistors represent binary information, in QCA, data is represented by the charge configuration. The primary and basic devic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.LO/0110061 شماره
صفحات -
تاریخ انتشار 1999